Dusty gas with SPH — I. Algorithm and test suite
نویسندگان
چکیده
We present a new algorithm for simulating two-fluid gas and dust mixtures in Smoothed Particle Hydrodynamics (SPH), systematically addressing a number of key issues including the generalised SPH density estimate in multi-fluid systems, the consistent treatment of variable smoothing length terms, finite particle size, time step stability, thermal coupling terms and the choice of kernel and smoothing length used in the drag operator. We find that using doublehump shaped kernels improves the accuracy of the drag interpolation by a factor of several hundred compared to the use of standard SPH bell-shaped kernels, at no additional computational expense. In order to benchmark our algorithm, we have developed a comprehensive suite of standardised, simple test problems for gas and dust mixtures: dustybox, dustywave, dustyshock, dustysedov and dustydisc, the first three of which have known analytic solutions. We present the validation of our algorithm against all of these tests. In doing so, we show that the spatial resolution criterion ∆ . csts is a necessary condition in all gas+dust codes that becomes critical at high drag (i.e. small stopping time ts) in order to correctly predict the dynamics. Implicit timestepping and the implementation of realistic astrophysical drag regimes are addressed in a companion paper.
منابع مشابه
Dusty gas with SPH — II. Implicit timestepping and astrophysical drag regimes
In a companion paper (Laibe & Price 2011b), we have presented an algorithm for simulating two-fluid gas and dust mixtures in Smoothed Particle Hydrodynamics (SPH). In this paper, we develop an implicit timestepping method that preserves the exact conservation of the both linear and angular momentum in the underlying SPH algorithm, but unlike previous schemes, allows the iterations to converge t...
متن کاملDusty gas with one fluid in smoothed particle hydrodynamics
In a companion paper we have shown how the equations describing gas and dust as two fluids coupled by a drag term can be re-formulated to describe the system as a single fluid mixture. Here we present a numerical implementation of the one-fluid dusty gas algorithm using Smoothed Particle Hydrodynamics (SPH). The algorithm preserves the conservation properties of the SPH formalism. In particular...
متن کاملThe viscous gas ring as an astrophysical test problem for a viscous SPH-code
We present the general analytic solution of a viscous gas ring around a central mass. This solution is used to test a further development of the smoothed particle hydrodynamics (SPH) algorithm, which is capable of simulating problems with physical viscosity (here: with kinematic viscosity). We discuss some SPH simulation results and conclude some fundamental properties of the algorithm. c © 199...
متن کاملPresenting a Modified SPH Algorithm for Numerical Studies of Fluid-Structure Interaction Problems
A modified Smoothed Particle Hydrodynamics (SPH) method is proposed for fluid-structure interaction (FSI) problems especially, in cases which FSI is combined with solid-rigid contacts. In current work, the modification of the utilized SPH concerns on removing the artificial viscosities and the artificial stresses (which such terms are commonly used to eliminate the effects of tensile and numeri...
متن کاملUsing the Particle Swarm Optimization Algorithm to Generate the Minimum Test Suite in Covering Array with Uniform Strength
Up to now, several useful algorithms have been proposed to generate covering array, which is one of the branches of combinatorial testing. The main challenge in generating such arrays is generation of the arrays with a minimum number of test cases (for efficiency) at a proper time (for performance), for large systems. Covering array generation strategies are often divided into two general categ...
متن کامل